2 The AKS Algorithm
نویسندگان
چکیده
At a high level, the AKS algorithm for finding the shortest vector in a lattice works by taking a large sphere or box and choosing many (e.g. ∼ 2) random lattice points in the box by taking random combinations of the basis. The points are then refined through an iterative routine called sieving. The sieving procedure Sieve(Y ) will have the following properties. Sieve(Y ) = C ⊆ Y such that: • For all y ∈ Y , there exists y′ ∈ C such that ‖y − y′‖ ≤ R/2. • |C| ≤ 5.
منابع مشابه
Sieve algorithms for the shortest vector problem are practical
The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in cryptology. The best approximation algorithms known for SVP in high dimension rely on a subroutine for exact SVP in low dimension. In this paper, we assess the practicality of the best (theoretical) algorithm known for exact SVP in low dimension: the sieve algorithm proposed by Ajtai, Kumar and ...
متن کاملAn Empirical Study towards Refining the AKS Primality Testing Algorithm
The AKS (Agrawal-Kayal-Saxena) algorithm is the first ever deterministic polynomialtime primality-proving algorithm whose asymptotic run time complexity is O(log n), where > 0. Despite this theoretical breakthrough, the algorithm serves no practical use in conventional cryptologic applications, as the existing probabilistic primality tests like ECPP in conjunction with conditional usage of sub-...
متن کاملMechanisation of AKS Algorithm: Part 1 - The Main Theorem
The AKS algorithm (by Agrawal, Kayal and Saxena) is a significant theoretical result proving “PRIMES in P”, as well as a brilliant application of ideas from finite fields. This paper describes the first step towards the goal of a full mechanisation of this result: a mechanisation of the AKS Main Theorem, which justifies the correctness (but not the complexity) of the AKS algorithm.
متن کاملSome remarks and questions about the AKS algorithm and related conjecture
We show that AKS-algorithm for primality testing ( see [1]) can be modified to run in Õ(log n) time. We present some remarks and ask two questions related to this algorithm.
متن کاملA Note On the Storage Requirement for AKS Primality Testing Algorithm
We remark that AKS primality testing algorithm needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits. Such storage requirement is hard to meet in practice. To the best of our knowledge, it is impossible for current operating systems to write and read data in so huge storage space. Thus, the running time for AKS algorithm should not be simply estimated as usual in terms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015